A Tradeoff Between Search and Update Time for the Implicit Dictionary Problem
نویسندگان
چکیده
This paper proves a tradeoff between the time it takes to search for elements in an implicit dictionary and the time it takes to update the value of elements in specified locations of the dictionary. It essentially shows that if the update time is constant, then the search time is $\Omega(n’)$ for some constant $\varepsilon >0$.
منابع مشابه
An Implicit Data Structure for the Dictionary Problem that Runs in Polylog Time
We introduce a data structure that requires only one pointer for every k data values and permits the operations search, insert and delete to be performed in 0 (k log n ) time. This structure is used to develop another that requires no pointers and supports insert, delete and search in 0 (log2 n ) time. 1. The Problem and the Results Pointers are routinely used to indicate relationship between k...
متن کاملEffects of Project Uncertainties on Nonlinear Time-Cost Tradeoff Profile
This study presents the effects of project uncertainties on nonlinear time-cost tradeoff (TCT) profile of real life engineering projects by the fusion of fuzzy logic and artificial neural network (ANN) models with hybrid meta-heuristic (HMH) technique, abridged as Fuzzy-ANN-HMH. Nonlinear time-cost relationship of project activities is dealt with ANN models. ANN models are then integrated with ...
متن کاملA New Mathematical Approach based on Conic Quadratic Programming for the Stochastic Time-Cost Tradeoff Problem in Project Management
In this paper, we consider a stochastic Time-Cost Tradeoff Problem (TCTP) in PERT networks for project management, in which all activities are subjected to a linear cost function and assumed to be exponentially distributed. The aim of this problem is to maximize the project completion probability with a pre-known deadline to a predefined probability such that the required additional cost is min...
متن کاملMulti-objective optimization of discrete time–cost tradeoff problem in project networks using non-dominated sorting genetic algorithm
The time–cost tradeoff problem is one of the most important and applicable problems in project scheduling area. There are many factors that force the mangers to crash the time. This factor could be early utilization, early commissioning and operation, improving the project cash flow, avoiding unfavorable weather conditions, compensating the delays, and so on. Since there is a need to allocate e...
متن کاملImplicit B-Trees: New Results for the Dictionary Problem
We reopen the issue of finding an implicit data structure for the dictionary problem. In particular, we examine the problem of maintaining n data values in the first n locations of an array in such a way that we can efficiently perform the operations insert, delete and search. No information other than n and the data is to be retained; and the only operations which we may perform on the data va...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 58 شماره
صفحات -
تاریخ انتشار 1986